Théorie de Kummer-Artin-Schreier et applications
نویسندگان
چکیده
منابع مشابه
The Artin-schreier Theorem
The algebraic closure of R is C, which is a finite extension. Are there other fields which are not algebraically closed but have an algebraic closure which is a finite extension? Yes. An example is the field of real algebraic numbers. Since complex conjugation is a field automorphism fixing Q, and the real and imaginary parts of a complex number can be computed using field operations and comple...
متن کاملThéorie De Jauge Et Groupo¨ıdes
Les résultats de cet article concernent leprobì eme de l'existence de représentations d'un groupo¨ıde topologique sur un fibré principal et leur classificationà transformation de jauge près. De telles représentations interviennent naturellement dans divers contextes (théo-ries de jauge classiques ou sur graphe, fibréséquivariants, etc).
متن کاملOn the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions
In this paper, we study the discrete logarithm problem in the finite fields Fqn where n|q−1. The field is called a Kummer field or a Kummer extension of Fq. It plays an important role in improving the AKS primality proving algorithm. It is known that we can efficiently construct an element g with order greater than 2 in the fields. Let Sq(•) be the function from integers to the sum of digits in...
متن کاملThe Two Artin-Schreier Theorems
Proof. We prove by the following steps: y 1 Start with induction on n, for n = 1 the result is trivial. y 2 Let g be such that σ1(g) ̸= σ2(g) and consider ∑ aiσi(gx) = 0 and ∑ aiσ1(g)σi(x) = 0 y 3 Cancel one summand by showing a2 = 0 and eventually show all ai = 0 One can prove by induction. Let a1σ1 ≡ 0 then since σ1 does not map to 0 ∈ K one must have a1 = 0. Suppose now that for any linear co...
متن کاملIsomorphisms between Artin-Schreier towers
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over a fixed field Fq can be computed, composed, and inverted in time essentially linear in pn. The method relies on an approximation process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 1995
ISSN: 1246-7405
DOI: 10.5802/jtnb.140